Service Guaranteed Scheduling Model of the MPMS Packet Switching Fabric

نویسندگان

  • Xiangjie Ma
  • Xiaozhong Li
  • Xinglong Fan
چکیده

In this paper, the service guaranteed scheduling model was proposed for the MPMS switching fabric. Firstly, the service distribution characteristic of each cell flow was analyzed in the MPMS switching fabric. Then, the service guaranteed distributed architecture was designed, and the scheduling model is proposed for demultiplexors, multiplexors, input switching units, middle switching units and output switching units in the MPMS fabric, respectively. Finally, we evaluated the proposed service guaranteed scheduling model (SGS-MPMS) under ON-OFF burst traffic. Simulation results show that SGS-MPMS can overcome the problem of delay divergence for traditional iSLIP, and PPS method, and provide delay guaranteed performance under ON-OFF burst traffic, and converge to the optimal delay curve with only four switching planes and four iterations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feedback control in a distributed scheduling architecture

Multiple-module, multi-stage packet switching systems are gaining popularity as a scalable solution to the ever increasing demand for the aggregate switching capacity. Due to additional contention points between the stages, such systems differ in their behavior from single-module output-buffered switches, which serve as a model for most of the advanced Quality of Service (QoS) scheduling algori...

متن کامل

On the Provision of Integrated Qos Guarantees of Switches * Unicast and Multicast Traffic in Input - Queued

In this paper, we address the problem of providing QoS guarantees for multiple input-queued switching architecture. Stable matching of inputs and outputs is used for scheduling the enqueued packets to be transmitted across the switching fabric. With an in-depth theoretic analysis on the properties of stable matching in the context of a multiple input-queued switch, we propose efficient schemes ...

متن کامل

Geometry of Packet Switching: Maximal Throughput Cone Scheduling Algorithms

In this chapter, we discuss the key ideas underlying some recent developments in packet switching. They concern algorithms for scheduling packets through switching fabrics, primarily to maximize throughput and support differentiated quality of service. We first develop a model capturing the packet queueing and scheduling dynamics of the switch in a ‘vectorized’ framework, which allows for the r...

متن کامل

On the support of minimum service rates for input queue switches

The fast growth of the Internet has made popular applications with diverse and stringent transmission requirements. In order to meet this demand, packet switches today are designed to include the support of Quality of Service (QoS) as a powerful product differentiator. Customized packet handling on a flow by flow basis, ensuring switching objectives such as guaranteed throughput and bounded swi...

متن کامل

Minimum Delay Scheduling in Scalable Hybrid Electronic/Optical Packet Switches

A hybrid electronic/optical packet switch consists of electronically buffered line-cards interconnected by an optical switch fabric. It provides a scalable switch architecture for next generation high-speed routers. Due to the non-negligible switch reconfiguration overhead, many packet scheduling algorithms are invented to ensure performance guaranteed switching (i.e. 100% throughput with bound...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCP

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2013